Construction of uniquely decodable codes for the two-user binary adder channel
نویسندگان
چکیده
منابع مشابه
Construction of Uniquely Decodable Codes for the Two-User Binary Adder Channel
A construction of uniquely decodable codes for the two-user binary adder channel is presented. The rates of the codes obtained by this construction are greater than the rates guaranteed by the Coebergh van den Braak and van Tilborg construction and these codes can be used with simple encoding and decoding procedures.
متن کاملExistence of Good 6-Decodable Codes for the Two-User Multiple-Access Adder Channel
This paper dejines a class of Gdecodable codrs,for the two-user multipk-access adder channel with binarv inputs. This class is a generalization of the class of two-user codes investigated by Kasami and Lin (1978). Lower hounds on the achievable rates of codes in this class are derived. We show that,for a wide range oferror correcting capability. this class contains good two-user Gdecodable code...
متن کاملSome families of zero- error block codes for the two-user binary adder channel with feedback
Families of zero-error codes for the real binary adder channel with feedback that achieve high rate pairs are introduced. Two families of zero-error block codes are given for the case in which only one of the two senders receives feedback about the channel output. In the first of these families, the uninformed sender transmits at a rate of nearly one bit per symbol and the informed sender trans...
متن کاملIterative decoding of turbo convolutional codes over the noisy two-user binary adder channel
Introduction: The two-user binary adder channel (2-BAC) is one of the simplest models for a multiple access channel [1]. The 2-BAC is a memoryless channel which, at each time interval, accepts two binary inputs, one from each user. Unless stated otherwise, we will assume that the binary alphabet {0, 1} of each user is mapped as 0 → 1 and 1 → −1 to feed the 2-BAC and that in the absence of noise...
متن کاملEfficiently Decodable Codes for the Binary Deletion Channel
In the random deletion channel, each bit is deleted independently with probability p. For the random deletion channel, the existence of codes of rate (1− p)/9, and thus bounded away from 0 for any p < 1, has been known. We give an explicit constructionwith polynomial time encoding and deletion correction algorithms with rate c0(1 − p) for an absolute constant c0 > 0.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1999
ISSN: 0018-9448
DOI: 10.1109/18.746834